Centroidal Voronoi Tessellation Algorithms for Image Processing

نویسندگان

  • Qiang Du
  • Max Gunzburger
  • Lili Ju
  • X. Wang
چکیده

Centroidal Voronoi tessellations (CVT’s) are special Voronoi tessellations for which the generators of the tessellation are also the centers of mass (or means) of the Voronoi cells or clusters. CVT’s have been found to be useful in many disparate and diverse settings. In this paper, CVT-based algorithms are developed for image compression, image segmenation, and multichannel image restoration applications. In the image processing context and in its simplest form, the CVT-based methodology reduces to the wellknown k-means clustering technique. However, by viewing the latter within the CVT context, very useful generalizations and improvements can be easily made. Several such generalizations are exploited in this paper including the incorporation of cluster dependent weights, the incorporation of averaging techniques to treat noisy images, extensions to treat multichannel data, and combinations of the aforementioned. In each case, examples are provided to illustrate the efficiency, flexibility, and effectiveness of CVT-based image processing methodologies.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Centroidal Voronoi Tessellations: Applications and Algorithms

A centroidal Voronoi tessellation is a Voronoi tessellation whose generating points are the centroids (centers of mass) of the corresponding Voronoi regions. We give some applications of such tessellations to problems in image compression, quadrature, finite difference methods, distribution of resources, cellular biology, statistics, and the territorial behavior of animals. We discuss methods f...

متن کامل

Centroidal Voronoi Tessellations : Applications and Algorithms ∗ Qiang Du

A centroidal Voronoi tessellation is a Voronoi tessellation whose generating points are the centroids (centers of mass) of the corresponding Voronoi regions. We give some applications of such tessellations to problems in image compression, quadrature, finite difference methods, distribution of resources, cellular biology, statistics, and the territorial behavior of animals. We discuss methods f...

متن کامل

On The Characterization and Uniqueness of Centroidal Voronoi Tessellations

Vector quantization is a classical signal-processing technique with significant applications in data compression, pattern recognition, clustering, and data stream mining. It is well known that for critical points of the quantization energy, the tessellation of the domain is a centroidal Voronoi tessellation. However, for dimensions greater than one, rigorously verifying a given centroidal Voron...

متن کامل

Numerical Studies of MacQueen’s k-Means Algorithm for Computing the Centroidal Voronoi Tessellations

We study a probabilistic algorithm for the computation of the centroidal Voronoi tessellation which is a Voronoi tessellation of a given set such that the associated generating points are centroids (centers of mass) of the corresponding Voronoi regions. We discuss various issues related to the implementation of the algorithm and provide numerical results. Some measures to improve the performanc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005